Crowdsourcing planar facility location allocation problems
نویسندگان
چکیده
منابع مشابه
Mixed planar and network single-facility location problems
We consider the problem of optimally locating a single facility anywhere in a network to serve both on-network and off-network demands. Off-network demands occur in a Euclidean plane, while on-network demands are restricted to a network embedded in the plane. On-network demand points are serviced using shortest-path distances through links of the network (e.g., on-road travel), whereas demand p...
متن کاملSequential Competitive Facility Location Problem in a Discrete Planar Space
In this paper, there are two competitors in a planar market. The first competitor, called, the leader, opens new facilities. After that, the second competitor, the follower, reacts to the leader’s action and opens r new facilities. The leader and the follower have got some facilities in advance in this market. The optimal locations for leader and follower are chosen among predefined candida...
متن کاملReverse facility location problems
In the Nearest Neighbor problem (NN), the objects in the database that are nearer to a given query object than any other objects in the database have to be found. In the conceptually inverse problem, Reverse Nearest Neighbor problem (RNN), objects that have the query object as their nearest neighbor have to be found. Reverse Nearest Neighbors queries have emerged as an important class of querie...
متن کاملHardness of Facility Location Problems
1.2 Hardness of k-median Theorem 1. It is hard to approximate k-median within 1+ 2 e1/c for any c < 1. This theorem is equivalent to the 1− 1/e− hardness shown in [2] and follows from a standard reduction from set cover. The main idea is to take an approximation algorithm for k-median, and use it to obtain a partial set cover. Then repeat this process, again partially covering the remaining ite...
متن کاملMulti-level facility location problems
We conduct a comprehensive review on multi-level facility location problems which extend several classical facility location problems and can be regarded as a subclass within the well-established field of hierarchical facility location. We first present the main characteristics of these problems and discuss some similarities and differences with related areas. Based on the types of decisions in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computing
سال: 2018
ISSN: 0010-485X,1436-5057
DOI: 10.1007/s00607-018-0670-1